An approximation algorithm for the maximum cut problem and its experimental analysis

An Approximation Algorithm for the Maximum Cut Problem 138

An approximation algorithm for Max Cut is designed and analyzed; its performances are experimentally compared with those of a neural algorithm and of the Goemans and Williamson's algorithm.

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Approximation Algorithm for Maximum Cut

Approximation Algorithms for the Maximum Cut Problem

Consider the problem of keeping closely related objects together and seperating unrelated objects from each other. This idea has clear applications to statistics, computer science, mathematics, social studies, and natural sciences just to name a few. To model this idea, we de ne the maximum cut problem that is simple to state but di cult to solve. The aim of this report is to provide two known ...

An Improved Maximum Neural Network Algorithm for Maximum Cut Problem

In this paper, we propose a new parallel algorithm that can help the maximum neural network escape from local minima for maximum cut problem. By adding a nonlinear self-feedback to the maximum neural network, the proposed parallel algorithm has richer and more flexible dynamics and can prevent the network from getting stuck at local minima. A large number of instances have been simulated to ver...